Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide
نویسندگان
چکیده
We study links between approximation, exponential time computation and fixed parameter tractability. In particular, rather than focusing on one particular optimization problem, we tackle the question of finding sufficient conditions for a problem to admit “good” approximation algorithms in exponential time. In particular, we focus on the existence of “approximation schemata” (ratios 1 ± ǫ for arbitrarily small ǫ) and we exhibit conditions under which a technique of devising approximate branching algorithms reaches interesting results.
منابع مشابه
Laboratoire d ’ Analyse et Modélisation de Systèmes pour d ’ Aide à la Décision UMR 7243 Juin 201 4 Preferences in Artificial
متن کامل
Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Décembre 2012 A note on Using T - joins to Approximate Solutions for CAHIER DU 32 9
We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .
متن کاملLaboratoire d ’ Analyse et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 201 5 On social rankings and their properties
Several real-life complex systems, like human societies or economic networks, are formed by interacting units characterized by patterns of relationships that may generate a group-based social hierarchy. In this paper, we address the problem of how to rank the individuals with respect to their ability to “influence” the relative strength of groups in a society. We also analyse the effect of basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012